Elementary bounded languages

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded Counter Languages

We show that deterministic finite automata equipped with k two-way heads are equivalent to deterministic machines with a single two-way input head and k− 1 linearly bounded counters if the accepted language is strictly bounded, i.e., a subset of a∗1a ∗ 2 · · · a ∗ m for a fixed sequence of symbols a1, a2, . . . , am. Then we investigate linear speed-up for counter machines. Lower and upper time...

متن کامل

Scope-Bounded Pushdown Languages

We study the formal language theory of multistack pushdown automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa). We show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa). We prove the equivalence of the deterministic ...

متن کامل

On Reversal-Bounded Picture Languages

Kim, C. and I.H. Sudborough, On reversal-bounded picture languages, Theoretical Computer Science 104 (1992) 185-206. For an integer k >O, a k-reversal-bounded picture language is a chain-code picture language which is described by a language L over the alphabet R= {u,d,r, I} such that, for every word x in L, the number of alternating occurrences of r’s and I’s in x is bounded by k. It is shown ...

متن کامل

Bounded repairability of word languages

What do you do if a computational object (e.g. program trace) fails a specification? An obvious approach is to perform a repair : modify the object minimally to get something that satisfies the constraints. This approach has been investigated in the database community, for integrity constraints, and in the AI community for propositional logics. Here we study how difficult it is to repair a docu...

متن کامل

UEML: Coherent Languages and Elementary Constructs Determination

Nowadays, one of the important subjects of research in the enterprise modelling domain is the development of a unified language, often called UEML (Unified Enterprise Modelling Language). This paper is focused on one of the more illustrating points about UEML: the comparison of the constructs of the enterprise modelleling language. In previous work we have put in evidence few situations which c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1978

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(78)90839-2